A generalized symbolic Thomas algorithm for the solution of opposite-bordered tridiagonal linear systems
نویسندگان
چکیده
منابع مشابه
A New Symbolic Algorithm for Solving General Opposite-Bordered Tridiagonal Linear Systems
In the current article we propose a new efficient, reliable and breakdown-free algorithm for solving general opposite-bordered tridiagonal linear systems. An explicit formula for computing the determinant of an opposite-bordered tridiagonal matrix is investigated. Some illustrative examples are given.
متن کاملA Generalized Symbolic Thomas Algorithm
The current paper is mainly devoted to construct a generalized symbolic Thomas algorithm that will never fail. Two new efficient and reliable computational algorithms are given. The algorithms are suited for implementation using computer algebra systems (CAS) such as Mathematica, Macsyma and Maple. Some illustrative examples are given.
متن کاملNew Symbolic Algorithms For Solving A General Bordered Tridiagonal Linear System
X iv :1 30 3. 07 38 v1 [ cs .S C ] 4 M ar 2 01 3 New Symbolic Algorithms For Solving A General Bordered Tridiagonal Linear System A. A. KARAWIA∗ Computer science unit, Deanship of educational services, Qassim University, P.O.Box 6595, Buraidah 51452, Saudi Arabia. E-mail: [email protected] Abstract In this paper, the author present reliable symbolic algorithms for solving a general bordered tri...
متن کاملA Parallel Algorithm for Circulant Tridiagonal Linear Systems
In this paper, based upon the divide-and-conquer strategy, we propose a parallel algorithm for solving the circulant tridiagonal systems, which is simpler than the two previous algorithms proposed by Agui and Jimenez ( 1995) and Chung et al. ( 1995). Our algorithm can be easily generalized to solve the tridiagonal systems, the block-tridiagonal systems, and the circulant block-tridiagonal syste...
متن کاملThe Parallel QR Factorization Algorithm for Tridiagonal Linear Systems
We describe a new parallel solver in the class of partition methods for general, nonsingular tridiagonal linear systems. Starting from an already known partitioning of the coefficient matrix among the parallel processors, we define a factorization, based on the QR factorization, which depends on the conditioning of the sub-blocks in each processor. Moreover, also the reduced system, whose solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2015
ISSN: 0377-0427
DOI: 10.1016/j.cam.2015.05.026